A Process-aware Security Task Scheduling Algorithm

In this paper, a process-aware security taskscheduling algorithm is proposed as IOAware. The algorithm evaluates the performance of hardware in computing nodes, and estimates properties of a task while it is being executed. In subsequent assignments, the algorithm assigns tasks based on the performance of the TaskTracker and the task properties. To verify the theoretical feasibility of the proposed IOAware scheduling algorithm, a schedule model is proposed to implement the method. After applying the scheduling module in a Hadoop cluster with multiple experiments, the results show that, compared with the performances of the FIFO, computing capacity-scheduling, and fair-scheduling algorithms in terms of four aspects: response time, localization ratio of the data, system throughput, and system resources, IOAware scheduling algorithm can reach up to the disk IO effect of the Shared computing nodes, effectively reduce the execution time of the tasks and improve the throughput of the cluster. Subject Categories and Descriptors I.1.2 [Computing Methodologies]: Analysis of Algorithms; E.4 [Coding and Information Theory] General Terms: Computing, Task Scheduling, Process Aware